#include <stdio.h>
#include <string.h>
#include <stdlib.h>

	int a[1010];
	int f[2][1010];
	int mark[2][1010];
	int n, ct = 0;

int max(int a, int b)
{
	return (a>b)?a:b;
}

int min(int a, int b)
{
	return (a<b)?a:b;
}

main()
{
	int i, j, k, len, u;

	//debug
	//freopen("h.txt", "r", stdin);

	while (scanf("%d", &n), n>0)
	{
		for (i=1; i<=n; i++)
			scanf("%d", a+i);
		memset(f, 0, sizeof(f));
		memset(mark, 0, sizeof(mark));

		//initialize
		u = 0;
		for (i=1; i<n; i++) // 1..n-1
		{
			f[u][i] = max(a[i], a[i+1]) - min(a[i], a[i+1]);
			mark[u][i] = 1;
		}

		// DP
		for (len=2; len<n; len+=2)
		{
			memset(mark[1-u], 0, sizeof(mark[1-u]));
			memset(f[1-u], 0, sizeof(f[1-u]));
			for (i=1; i<=n; i++)
				if (mark[u][i] == 1)
				{
					if (i<=n-2-len+1) //|ai...ai+len-1|bc
					{
						if (a[i] < a[i+len])
							if (mark[1-u][i] == 0 || f[u][i]+a[i+len+1]-a[i+len]>f[1-u][i])
							{
								mark[1-u][i] = 1;
								f[1-u][i] = f[u][i] + a[i+len+1] - a[i+len];
							}
					}
					if (i>1 && i<=n-len) // b|ai..ai+len-1|c
					{
						if (a[i] < a[i+len])
							if (mark[1-u][i-1] == 0 || f[u][i]+a[i-1]-a[i+len]>f[1-u][i-1])
							{
								mark[1-u][i-1] = 1;
								f[1-u][i-1] = f[u][i] + a[i-1] - a[i+len];
							}
						if (a[i-1] >= a[i+len-1])
							if (mark[1-u][i-1] == 0 || f[u][i]+a[i+len]-a[i-1]>f[1-u][i-1])
							{
								mark[1-u][i-1] = 1;
								f[1-u][i-1] = f[u][i] + a[i+len] - a[i-1];
							}
					}
					if (i>2) // bc|ai..ai+len-1|
					{
						if (a[i-1] >= a[i+len-1])
							if (mark[1-u][i-2] == 0 || f[u][i]+a[i-2]-a[i-1]>f[1-u][i-2])
							{
								mark[1-u][i-2] = 1;
								f[1-u][i-2] = f[u][i] + a[i-2] - a[i-1];
							}
					}
				}
			u = 1 - u;
		}
		printf("In game %d, the greedy strategy might lose by as many as %d points.\n", ++ct, f[u][1]);
	}
	return 0;
}
